A New Upper Bound On Forwarding Index of Graphs
نویسندگان
چکیده
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communication networks. IEEE Trans. Inform. Theory, 33 (2) (1987), 224-232] proposed the notion of forwarding index and established the tight upper bound (n − 1)(n − 2) for a connected graph of order n. This note improves this bound in terms of order n and maximum degree ∆ to the tight upper bound (n−1)(n−2)− ( 2n− 2−∆ ⌊ 1 + n−1 ∆ ⌋) ⌊ n−1 ∆ ⌋ . This bound is best possible in sense that there is a graph G attaining the upper bound.
منابع مشابه
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملOn strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملA note on the first Zagreb index and coindex of graphs
Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 83 شماره
صفحات -
تاریخ انتشار 2007